| 1. | Usually , pessimistic locks aren ' t the most scalable approach to concurrency
通常，悲观锁是不适合大规模并发操作的。 |
| 2. | A pessimistic lock is a lock that is acquired when an item of data is read and that is held until transaction completion
悲观锁是指：它在数据被读取时获取，在事务结束时释放。 |
| 3. | Similarly , web forms applications may not be suitable for database applications that require high levels of concurrency control for example , pessimistic locking
同样， web窗体应用程序可能不适合需要高级别并发控制（例如，保守式锁定）的数据库应用程序。 |
| 4. | In read - committed mode ( our preferred transaction isolation level ) , the database never acquires pessimistic locks unless explicitly requested by the application
在“授权读取”模式下（我们推荐的事务隔离级别） ，数据库将永不使用悲观锁，除非应用程序特别的显式生气。 |
| 5. | Few existing applications use serializable isolation in production ; rather , they use pessimistic locks , which effectively forces a serialized execution of operations in certain situations
目前使用序列化隔离的应用中，一般都使用的悲观锁，这样强行使得所有事务都序列化执行。 |
| 6. | About the question of consistency of time in distributed system , an algorithm that studied by beijing university of aeronautics and astronautics is introduced . i also ameliorate this algorithm on the basis of requirement for distributed virtual experiment . after analysis of many methods for concurrent control and the requirement of my system , i adopt the method of pessimistic lock
在处理分布式并发控制的问题时，本文在研究具体系统需求的基础上，对多种并发控制方法进行了分析比较，最终采用“悲观加锁法”作为系统实现过程中并发控制的处理方法。 |
